-
1 decidable language
Большой англо-русский и русско-английский словарь > decidable language
-
2 decidable language
Математика: разрешимый язык -
3 decidable language
мат. -
4 decidable
разрешимый effectively decidable function ≈ эффективно разрешимая функция effectively decidable predicate ≈ эффективно разрешимый предикат effectively decidable relation ≈ эффективно разрешимое отношение formally decidable formula ≈ формально разрешимая формула numeralwise decidable formula ≈ нумерически разрешимая формула numeralwise decidable function ≈ нумерически разрешимая функция numeralwise decidable predicate ≈ нумерически разрешимый предикат - completely decidable - decidable algebra - decidable arithmetic - decidable formula - decidable language - decidable predicate - decidable proposition - decidable relation - decidable sentence - decidable set - decidable statement - decidable system - decidable theor - effectively decidable - formally decidable - numeralwise decidable - partially decidable разрешимый - * set (математика) разрешимое множествоБольшой англо-русский и русско-английский словарь > decidable
-
5 language
- absolutely homogeneous language - absolutely inadequate language - absolutely nonhomogeneous language - absolutely nonperfect language - absolutely nonsimple language - absolutely perfect language - absolutely simple language - completely formalized language - completely homogeneous language - left categorial language - locally perfectly adequate language - locally simple language - locally strongly language - locally well adequate language - noncompletely homogeneous language - right categorial language - scattered context languageindistinguishable in the language — лог. неразличимый на языке, эквивалентный
-
6 разрешимый язык
Большой англо-русский и русско-английский словарь > разрешимый язык
См. также в других словарях:
Decidable — The word decidable may refer to: Decidable language Decidability (logic) for the equivalent in mathematical logic Gödel s incompleteness theorem, a theorem on the indecidability of languages consisting of true statements in mathematical logic.… … Wikipedia
List of formal language and literal string topics — This is a list of formal language and literal string topics, by Wikipedia page. Contents 1 Formal languages 2 Literal strings 3 Classical cryptography Formal languages Abstract syntax tree … Wikipedia
Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… … Wikipedia
Context-free language — In formal language theory, a context free language is a language generated by some context free grammar. The set of all context free languages is identical to the set of languages accepted by pushdown automata. Contents 1 Examples 2 Closure… … Wikipedia
Regular language — In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: * it can be accepted by a… … Wikipedia
Programming language for Computable Functions — The Programming language for Computable Functions, or PCF, is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Functions (LCF) by Dana Scott. It can be considered as a simplified version of… … Wikipedia
Programming language — lists Alphabetical Categorical Chronological Generational A programming language is an artificial language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs that… … Wikipedia
Web Ontology Language — OWL Web Ontology Language Current Status Published Year Started 2002 Editors Mike Dean, Guus Schreiber Base Standards Resource Description Framework, RDFS Domain Semantic Web A … Wikipedia
Mathematics as a language — The central question involved in discussing mathematics as a language can be stated as follows: : What do we mean when we talk about the language of mathematics? To what extent does mathematics meet generally accepted criteria of being a… … Wikipedia
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
Omega language — An ω language is a set of infinite length sequences of symbols. Contents 1 Formal definition 2 Operations 3 Distance between ω words 4 Important subclasses … Wikipedia
